﻿// Prime Test POJ - 1811.cpp : 此文件包含 "main" 函数。程序执行将在此处开始并结束。
//

/*
https://vjudge.net/problem/POJ-1811

Given a big integer number, you are required to find out whether it's a prime number.
Input
The first line contains the number of test cases T (1 <= T <= 20 ), 
then the following T lines each contains an integer number N (2 <= N < 254).
Output
For each test case, if N is a prime number, output a line containing the word "Prime", 
otherwise, output a line containing the smallest prime factor of N.
Sample
2
5
10


Prime
2

*/
#include <iostream>

int main()
{
    std::cout << "Hello World!\n";
}

 